Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

A hybrid genetic algorithm for solving no-wait flowshop scheduling problems

A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are represe...

On the exact solution of the no-wait flow shop problem with due date constraints

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

َa multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...